Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
نویسندگان
چکیده
We study nondeterministic strategies in parity games with the aim of computing a most permissive winning strategy. Following earlier work, we measure permissiveness in terms of the average number/weight of transitions blocked by a strategy. Using a translation into mean-payoff parity games, we prove that deciding (the permissiveness of) a most permissive winning strategy is in NP ∩ coNP. Along the way, we provide a new study of mean-payoff parity games. In particular, we give a new algorithm for solving these games, which beats all previously known algorithms for this problem.
منابع مشابه
A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games
In a mean-payoff parity game, one of the two players aims both to achieve a qualitative parity objective and to minimize a quantitative long-term average of payoffs (aka. mean payoff). The game is zero-sum and hence the aim of the other player is to either foil the parity objective or to maximize the mean payoff. Our main technical result is a pseudo-quasi-polynomial algorithm for solving mean-...
متن کاملWindow Parity Games: An Alternative Approach Toward Parity Games with Time Bounds (Full Version)
Classical objectives in two-player zero-sum games played on graphs often deal with limit behaviors of infinite plays: e.g., mean-payoff and total-payoff in the quantitative setting, or parity in the qualitative one (a canonical way to encode ω-regular properties). Those objectives offer powerful abstraction mechanisms and often yield nice properties such as memoryless determinacy. However, thei...
متن کاملDeciding the Winner in Parity Games Is in UP ∩ co-UP
We observe that the problem of deciding the winner in mean payoff games is in the complexity class UP ∩ co-UP. We also show a simple reduction from parity games to mean payoff games. From this it follows that deciding the winner in parity games and the modal μ-calculus model checking are in UP ∩ co-UP.
متن کاملReduction of stochastic parity to stochastic mean-payoff games
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with ω-regular winning conditions specified as parity objectives, and mean-payoff (or limit-average) objectives. These games lie in NP ∩ coNP. We present a polynomial-time Turing reduction of stochastic parity games to stochastic mean-payoff games.
متن کاملEnergy parity games☆
Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of energy in the game) must remain positive. Beside their own interest in the design and synthesis of resource-constrained omega-regular specifications, energy ...
متن کامل